Predator: A Verification Tool for Programs with Dynamic Linked Data Structures - (Competition Contribution)
نویسندگان
چکیده
Predator is a tool for automated formal verification of sequential C programs with dynamic linked data structures. It is in principle based on separation logic, but uses a graph-based heap representation. This paper first provides a brief overview of Predator and then discusses experience with its participation in the Software Verification Competition of TACAS’12.
منابع مشابه
Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic
Predator is a new open source tool for verification of sequential C programs with dynamic linked data structures. The tool is based on separation logic with inductive predicates although it uses a graph description of heaps. Predator currently handles various forms of lists, including singly-linked as well as doubly-linked lists that may be circular, hierarchically nested and that may have vari...
متن کاملPredator: A Tool for Verification of Low-Level List Manipulation - (Competition Contribution)
Predator is a tool for automated formal verification of sequential C programs operating with pointers and linked lists. The core algorithms of Predator were originally inspired by works on separation logic with higher-order list predicates, but they are now purely graph-based and significantly extended to support various forms of low-level memory manipulation used in system-level code. This pap...
متن کاملDYNAMIC COMPLEXITY OF A THREE SPECIES COMPETITIVE FOOD CHAIN MODEL WITH INTER AND INTRA SPECIFIC COMPETITIONS
The present article deals with the inter specific competition and intra-specific competition among predator populations of a prey-dependent three component food chain model consisting of two competitive predator sharing one prey species as their food. The behaviour of the system near the biologically feasible equilibria is thoroughly analyzed. Boundedness and dissipativeness of the system are e...
متن کاملVerification of Programs with Complex Data
In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...
متن کاملPredator Hunting Party (Competition Contribution)
This paper introduces PredatorHP (Predator Hunting Party), a program verifier built on top of the Predator shape analyser, and discusses its participation in the SV-COMP’15 software verification competition. Predator is a sound shape analyser dealing with C programs with lists implemented via low-level pointer operations. PredatorHP uses Predator to prove programs safe while at the same time us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012